Lattice Path Combinatorics — Applications to Probability and Statistics
نویسندگان
چکیده
A lattice path P in Z is a path in the d-dimensional integer lattice Z which uses only points of the lattice, that is, it is a sequence (P0, P1, . . . , Pl), where Pi ∈ Z d for all i. The vectors −−→ P0P1, −−→ P1P2, . . . , −−−−→ Pl−1Pl are called the steps of P . The number of steps, l, is called the length of P , and denoted by l(P ). Figure 1 shows a lattice path in Z of length 11. (The horizontal line labelled y = R− 2 should be ignored at the moment.)
منابع مشابه
Reminiscing over
Just after almost simultaneous publications in 1979 of two books, " Lattice Path Combinatorics with Statistical Applications " , by T.V. Narayana and " Lattice Path Counting and Applications " , by me, I realized that there was a substantial growing interest in lattice path combinatorics and applications in the fields of applied probability, statistics and computer science. I also realized that...
متن کاملThe Enumeration of Lattice Paths 3
We survey old and new results on the enumeration of lattice paths in the plane with a given number of turns, including the recent developments on the enumeration of nonintersecting lattice paths with a given number of turns. Motivations to consider such enumeration problems come from various elds, e.g. probability, statistics, combinatorics, and commutative algebra. We show that the appropriate...
متن کاملSingularity Analysis Via the Iterated Kernel Method
We provide exact and asymptotic counting formulas for five singular lattice path models in the quarter plane. Furthermore, we prove that these models have a non D-finite generating function. Résumé Nous présentons des résultats énumératives pour les cinq modèles de marches dans le quart de plan dites “singulière”. Nous prouvons que ces modéles sont non-holonome.
متن کاملCombinatorics of lattice paths with and without spikes
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label equivalence classes which allow a rearrangement of the sum over paths. The basic combinatorial quantities of this construction are given. These formulas are usefu...
متن کاملThe Minesweeper Game: Percolation And Complexity
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Z, and then tries to find an infinite path of mine free sites. At every recovery of a free site, the player is given some information on the sites adjacent to the current site. We compare the parameter values for which there exists a strategy such that the process s...
متن کامل